Robust Parallel Genetic Algorithms with Re-initialisation
نویسنده
چکیده
The influence of different parallel genetic algorithm (PGA) architectures on the GA convergence properties is analysed. Next, two proposed versions of these PGA architectures are compared – homogenous and heterogeneous. Finally the effect of re-initialisation in some partial populations on the PGA convergence has been analysed. The proposed PGA modifications are useful mainly in case of non-smooth cost function optimisation.
منابع مشابه
Solving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملThe Multidisciplinary Design Optimization of a Reentry Vehicle Using Parallel Genetic Algorithms
The purpose of this paper is to examine the multidisciplinary design optimization (MDO) of a reentry vehicle. In this paper, optimization of a RV based on, minimization of heat flux integral and minimization of axial force coefficient integral and maximization of static margin integral along reentry trajectory is carried out. The classic optimization methods are not applicable here due to the c...
متن کاملHybrid algorithms for Job shop Scheduling Problem with Lot streaming and A Parallel Assembly Stage
In this paper, a Job shop scheduling problem with a parallel assembly stage and Lot Streaming (LS) is considered for the first time in both machining and assembly stages. Lot Streaming technique is a process of splitting jobs into smaller sub-jobs such that successive operations can be overlapped. Hence, to solve job shop scheduling problem with a parallel assembly stage and lot streaming, deci...
متن کاملOn Extending of Search Power of Genetic Algorithms by Means of Permanent Re-initialisation of Parental Common Schema
Genetic algorithms are probabilistic search and optimisation techniques, which operate on a population of chromosomes, representing potential solutions of the given problem. In standard genetic algorithms (SGA), solutions are encoded as binary strings. Such a population is evolved by means of reproduction and recombination operators in order to breed the optimal solution’s chromosome. The weak ...
متن کامل